MULTIPLICATIVE GROUPS OF INTEGERS WITH SEMI-PRIMITIVE ROOTS MODULO n

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ROOTS OF UNITY AND NULLITY MODULO n

For a fixed positive integer , we consider the function of n that counts the number of elements of order in Zn. We show that the average growth rate of this function is C (logn) d( )−1 for an explicitly given constant C , where d( ) is the number of divisors of . From this we conclude that the average growth rate of the number of primitive Dirichlet characters modulo n of order is (d( )− 1)C (l...

متن کامل

ON THE SECOND MOMENT ESTIMATE INVOLVING THE λ-PRIMITIVE ROOTS MODULO n

Artin’s Conjecture on Primitive Roots states that a non-square non unit integer a is a primitive root modulo p for positive proportion of p. This conjecture remains open, but on average, there are many results due to P. J. Stephens (see [14], also [15]). There is a natural generalization of the conjecture for composite moduli. We can consider a as the primitive root modulo (Z/nZ)∗ if a is an el...

متن کامل

Probability of having $n^{th}$-roots and n-centrality of two classes of groups

In this paper, we consider the finitely 2-generated groups $K(s,l)$ and $G_m$ as follows:$$K(s,l)=langle a,b|ab^s=b^la, ba^s=a^lbrangle,\G_m=langle a,b|a^m=b^m=1, {[a,b]}^a=[a,b], {[a,b]}^b=[a,b]rangle$$ and find the explicit formulas for the probability of having nth-roots for them. Also, we investigate integers n for which, these groups are n-central.

متن کامل

ON THE MULTIPLICATIVE ORDER OF a MODULO n

Let n be a positive integer and αn be the arithmetic function which assigns the multiplicative order of an modulo n to every integer a coprime to n and vanishes elsewhere. Similarly, let βn assign the projective multiplicative order of a n modulo n to every integer a coprime to n and vanish elsewhere. In this paper, we present a study of these two arithmetic functions. In particular, we prove t...

متن کامل

A Gcd-Sum Function Over Regular Integers Modulo n

We introduce a gcd-sum function involving regular integers (mod n) and prove results giving its minimal order, maximal order and average order.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications of the Korean Mathematical Society

سال: 2013

ISSN: 1225-1763

DOI: 10.4134/ckms.2013.28.1.071